Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
نویسندگان
چکیده
منابع مشابه
Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach for efficiently solving the single-unit economic dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise...
متن کاملA new method for unit commitment with ramping constraints
Unit commitment with ramping constraints is a very difficult problem with significant economic impact. A new method is developed in this paper for scheduling units with ramping constraints within Lagrangian relaxation framework based on a novel formulation of the discrete states and the integrated applications of standard dynamic programming for determining the optimal discrete states across ho...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملSingle-Unit Commitment Problems in Electricity Pool Markets
We consider an electricity generator with a single generating unit making offers of energy into an electricity pool market. For a given time period, it must submit to the pool system operator a supply function, typically consisting of a fixed number of quantities of energy and prices at which it wants these dispatched. The amount of dispatch depends on the supply function offered along with the...
متن کاملGenetic Algorithm Based Tabu Search Method for Solving Unit Commitment Problem with Cooling –– Banking Constraints
This paper presents a new approach to solving the short-term unit commitment problem using the genetic algorithm based tabu search method with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2006
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1060.0309